Exact minimum degree thresholds for perfect matchings in uniform hypergraphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact minimum degree thresholds for perfect matchings in uniform hypergraphs

Article history: Received 19 August 2011 Available online xxxx Given positive integers k and where 4 divides k and k/2 k−1, we give a minimum -degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who gave an asymptotically exact result. Our approach makes use of the absorbing method, as well as the hypergrap...

متن کامل

Exact Minimum Degree Thresholds for Perfect Matchings in Uniform Hypergraphs Iii

We determine the exact minimum l-degree threshold for perfect matchings in k-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than 1 2 ( n k−l ) . This extends our previous results [18, 19] that determine the minimum l-degree thresholds for perfect matchings in k-uniform hypergraphs for all l ≥ k/2 and provides two new (exact) threshold...

متن کامل

Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II

Given positive integers k ≥ 3 and l where k/2 ≤ l ≤ k − 1, we give a minimum ldegree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who gave an asymptotically exact result, and extends work of Rödl, Ruciński and Szemerédi who determined the threshold for l = k − 1. Our approach makes use of the absorbing meth...

متن کامل

Tight Minimum Degree Conditions Forcing Perfect Matchings in Uniform Hypergraphs

Given positive integers k and ` where k/2 ≤ ` ≤ k− 1, we give a minimum `-degree condition that ensures a perfect matching in a kuniform hypergraph. This condition is best possible and improves on work of Pikhurko [12] who gave an asymptotically exact result, and extends work of Rödl, Ruciński and Szemerédi [15] who determined the threshold for ` = k−1. Our approach makes use of the absorbing m...

متن کامل

Perfect matchings in uniform hypergraphs with large minimum degree

A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a perfect matching in terms of a variant of the minimum degree. We prove that for every k ≥ 3 and sufficiently large n, a perfect matching exists in every n-vertex k-uniform hypergraph in which each set of k − 1 vertices ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2012

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2012.04.006